Finite Type and the Effective Nullstellensatz
نویسندگان
چکیده
Improved local and global versions of the effective Nullstellensatz for ideal sheaves on non-singular complex varieties are obtained, based on a new invariant motivated by the notion of finite type from the theory of several complex variables. Two closely related curve selection theorems for curves with maximal adjusted tangency orders to a given ideal sheaf are established along the way, using normalized blow-ups and integral closures.
منابع مشابه
Finite field Nullstellensatz and Grassmannians
Let X C ]p'N be a projective variety defined over the Galois field GF(q). Denote by X(q) the set of GF(q)-rational points of X. Let k be an integer. We say that the pair (X, X(q)) satisfies the Finite Field Nullstellensatz of order k, (the FFN(k), for short), if every homogeneous form of degree :::; k on r N (J<) vanishing on X (q), vanishes on X (J<). Here, we prove the Finite Field Nullstelle...
متن کاملSharp Estimates for the Arithmetic Nullstellensatz
We present sharp estimates for the degree and the height of the polynomials in the Nullstellensatz over the integer ring Z. The result improves previous work of P. Philippon, C. Berenstein and A. Yger, and T. Krick and L. M. Pardo. We also present degree and height estimates of intrinsic type, which depend mainly on the degree and the height of the input polynomial system. As an application we ...
متن کاملOn the Finite Field Nullstellensatz for the intersection of two quadric hypersurfaces
braic scheme defined over a finite field GFðpÞ.X ðKÞwill denote the set of allK-points of X . For every power q of p with qd p let XðqÞ denote the set of all GFðqÞ-points of X . Hence XðqÞJX ðq 0Þ if q, q 0 are p-powers and q 0 d qd p. XðKÞ is the union of all XðqÞ, qg 0 and q a p-power. If X is reduced, then the scheme X is uniquely determined by the algebraic variety XðKÞ in the sense of Serr...
متن کاملQuantifier Elimination over Finite Fields Using Gröbner Bases
We give an algebraic quantifier elimination algorithm for the first-order theory over any given finite field using Gröbner basis methods. The algorithm relies on the strong Nullstellensatz and properties of elimination ideals over finite fields. We analyze the theoretical complexity of the algorithm and show its application in the formal analysis of a biological controller model.
متن کامل